Nogood-based asynchronous forward checking algorithms
نویسندگان
چکیده
منابع مشابه
Asynchronous Forward-Checking on DisCSPs
A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. Forward checking is performed by sending copies of the partial assi...
متن کاملImproving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for the solution. The nogood type messages are sent among the agents with the purpose of realizing an intelligent backtrack and of ensuring the algorithm’s completion. In this article we analyzed the way in which a technique of obt...
متن کاملAsynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC ...
متن کاملDFS ordering in Nogood-based Asynchronous Distributed Optimization (ADOPT-ng)
This work proposes an asynchronous algorithm for solving Distributed Constraint Optimization problems (DCOPs) using a generalized kind of nogoods, called valued nogoods. The proposed technique is an extension of the asynchronous distributed optimization (ADOPT) where valued nogoods enable more flexible reasoning, leading to important speed-up. Valued nogoods are an extension of classic nogoods ...
متن کاملImproving the Performances of Asynchronous Search Algorithms in Scale-Free Networks Using the Nogood Processor Technique
The scale-free graphs were proposed as a generic and universal model of network topologies that exhibit power-law distributions in the connectivity of network nodes. In recent years various complex networks were identified as having a scale-free structure. Little research was done concerning the network structure for DisCSP, and in particular, for scale-free networks. The asynchronous searching...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2013
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-013-9144-4